Maximum cardinality neighbourly sets in quadrilateral free graphs
نویسندگان
چکیده
منابع مشابه
Maximum Cardinality Neighbourly Sets in Quadrilateral Free Graphs
Neighbourly set of a graph is a subset of edges which either share an end point or are joined by an edge of that graph. The maximum cardinality neighbourly set problem is known to be NP-complete for general graphs. Mahdian (M.Mahdian, On the computational complexity of strong edge coloring, Discrete Applied Mathematics, 118:239–248, 2002) proved that it is in polynomial time for quadrilateral-f...
متن کاملMaximum Cardinality Matchings in Fully Dynamic Graphs
In this paper, we examine recent developments in the Maximum Cardinality Matching (MCM) problem for fully dynamic graphs. Matchings represent a classical combinatorial structure. They have been thoroughly studied and are well understood in the static case. Recently, there’s been an interest for understanding other basic structures such as vertex covers, shortest paths and spanning trees in dyna...
متن کاملIndependent Sets of Maximum Weight in Apple-Free Graphs
We present the first polynomial-time algorithm to solve the maximum weight independent set problem for apple-free graphs, which is a common generalization of several important classes where the problem can be solved efficiently, such as claw-free graphs, chordal graphs, and cographs. Our solution is based on a combination of two algorithmic techniques (modular decomposition and decomposition by...
متن کاملNeighbourly Irregular Derived Graphs
A connected graph G is said to be neighbourly irregular graph if no two adjacent vertices of G have same degree. In this paper we obtain neighbourly irregular derived graphs such as semitotal-point graph, k^{tℎ} semitotal-point graph, semitotal-line graph, paraline graph, quasi-total graph and quasivertex-total graph and also neighbourly irregular of some graph products.
متن کاملComputing Maximum-Cardinality Matchings in Sparse General Graphs
We give an experimental study of a new O(mn (m; n))-time implementation of Edmonds' algorithm for a maximum-cardinality matching in a sparse general graph of n vertices and m edges. The implementation incorporates several optimizations resulting from a depth-rst order to search for augmenting paths, and we study the iteraction between four heuristics, each with the potential to signiicantly spe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Optimization
سال: 2015
ISSN: 1382-6905,1573-2886
DOI: 10.1007/s10878-015-9972-9